Search results for "Analysis of algorithms"

showing 10 items of 29 documents

Estimation of Granger causality through Artificial Neural Networks: applications to physiological systems and chaotic electronic oscillators

2021

One of the most challenging problems in the study of complex dynamical systems is to find the statistical interdependencies among the system components. Granger causality (GC) represents one of the most employed approaches, based on modeling the system dynamics with a linear vector autoregressive (VAR) model and on evaluating the information flow between two processes in terms of prediction error variances. In its most advanced setting, GC analysis is performed through a state-space (SS) representation of the VAR model that allows to compute both conditional and unconditional forms of GC by solving only one regression problem. While this problem is typically solved through Ordinary Least Sq…

Artificial neural networks; Chaotic oscillators; Granger causality; Multivariate time series analysis; Network physiology; Penalized regression techniques; Remote synchronization; State-space models; Stochastic gradient descent L1; Vector autoregressive modelGeneral Computer ScienceDynamical systems theoryComputer science02 engineering and technologyChaotic oscillatorsPenalized regression techniquesNetwork topologySettore ING-INF/01 - ElettronicaMultivariate time series analysisVector autoregression03 medical and health sciences0302 clinical medicineScientific Computing and Simulation0202 electrical engineering electronic engineering information engineeringRepresentation (mathematics)Optimization Theory and ComputationNetwork physiologyState-space modelsArtificial neural networkArtificial neural networksData ScienceTheory and Formal MethodsQA75.5-76.95Stochastic gradient descent L1Granger causality State-space models Vector autoregressive model Artificial neural networks Stochastic gradient descent L1 Multivariate time series analysis Network physiology Remote synchronization Chaotic oscillators Penalized regression techniquesRemote synchronizationStochastic gradient descentAutoregressive modelAlgorithms and Analysis of AlgorithmsVector autoregressive modelElectronic computers. Computer scienceSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaGranger causality020201 artificial intelligence & image processingGradient descentAlgorithm030217 neurology & neurosurgeryPeerJ Computer Science
researchProduct

Fast and Simple Approximation of the Diameter and Radius of a Graph

2006

The increasing amount of data to be processed by computers has led to the need for highly efficient algorithms for various computational problems. Moreover, the algorithms should be as simple as possible to be practically applicable. In this paper we propose a very simple approximation algorithm for finding the diameter and the radius of an undirected graph. The algorithm runs in $O(m\sqrt{n})$ time and gives an additive error of $O(\sqrt{n})$ for a graph with n vertices and m edges. Practical experiments show that the results of our algorithm are close to the optimum and compare favorably to the 2/3-approximation algorithm for the diameter problem by Aingworth et al [1].

CombinatoricsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYGraph (abstract data type)Approximation algorithmAlgorithm engineeringRadiusComputational problemStrength of a graphDistanceMathematicsofComputing_DISCRETEMATHEMATICSAnalysis of algorithmsMathematics
researchProduct

Path Integral Methods for the Probabilistic Analysis of Nonlinear Systems Under a White-Noise Process

2020

Abstract In this paper, the widely known path integral method, derived from the application of the Chapman–Kolmogorov equation, is described in details and discussed with reference to the main results available in literature in several decades of contributions. The most simple application of the method is related to the solution of Fokker–Planck type equations. In this paper, the solution in the presence of normal, α-stable, and Poissonian white noises is first discussed. Then, application to barrier problems, such as first passage problems and vibroimpact problems is described. Further, the extension of the path integral method to problems involving multi-degrees-of-freedom systems is anal…

Nonlinear systemComputer scienceMechanical Engineering0103 physical sciencesPath integral formulationApplied mathematicsProbabilistic analysis of algorithmsWhite noiseSafety Risk Reliability and Quality010301 acoustics01 natural sciencesSafety Research010305 fluids & plasmasASCE-ASME J Risk and Uncert in Engrg Sys Part B Mech Engrg
researchProduct

A method for the probabilistic analysis of nonlinear systems

1995

Abstract The probabilistic description of the response of a nonlinear system driven by stochastic processes is usually treated by means of evaluation of statistical moments and cumulants of the response. A different kind of approach, by means of new quantities here called Taylor moments, is proposed. The latter are the coefficients of the Taylor expansion of the probability density function and the moments of the characteristic function too. Dual quantities with respect to the statistical cumulants, here called Taylor cumulants, are also introduced. Along with the basic scheme of the method some illustrative examples are analysed in detail. The examples show that the proposed method is an a…

Characteristic function (probability theory)Stochastic processMechanical EngineeringAerospace EngineeringOcean EngineeringStatistical and Nonlinear PhysicsProbability density functionCondensed Matter Physicssymbols.namesakeNonlinear systemNuclear Energy and EngineeringTaylor seriessymbolsCalculusApplied mathematicsProbabilistic analysis of algorithmsCumulantCivil and Structural EngineeringMathematicsTaylor expansions for the moments of functions of random variables
researchProduct

A comprehensive probabilistic analysis of approximate SIR‐type epidemiological models via full randomized discrete‐time Markov chain formulation with…

2020

Spanish Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P; Generalitat Valenciana, Grant/Award Number: APOSTD/2019/128; Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P

010101 applied mathematicsDiscrete mathematicsMarkov chainDiscrete time and continuous timeGeneral Mathematics010102 general mathematicsGeneral EngineeringProbabilistic analysis of algorithms0101 mathematicsType (model theory)01 natural sciencesMathematicsMathematical Methods in the Applied Sciences
researchProduct

Ultrametric Vs. Quantum Query Algorithms

2014

Ultrametric algorithms are similar to probabilistic algorithms but they describe the degree of indeterminism by p-adic numbers instead of real numbers. This paper introduces the notion of ultrametric query algorithms and shows an example of advantages of ultrametric query algorithms over deterministic, probabilistic and quantum query algorithms.

Quantum queryDegree (graph theory)Computer scienceComputer Science::Information RetrievalProbabilistic logicMathematics::General TopologyCondensed Matter::Disordered Systems and Neural NetworksIndeterminismMathematics::Metric GeometryProbabilistic analysis of algorithmsQuantum algorithmAlgorithmUltrametric spaceComputer Science::DatabasesMathematicsofComputing_DISCRETEMATHEMATICSReal number
researchProduct

A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms

2013

Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.

Distance-vector routing protocolLink-state routing protocolComputer scienceAnt colony optimization algorithmsComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSMultipath routingComputer Science::Networking and Internet ArchitectureProbabilistic logicPath vector protocolProbabilistic analysis of algorithmsRouting (electronic design automation)Algorithm
researchProduct

A Probabilistic Analysis to Quantify the Effect of March 11, 2004, Attacks in Madrid on the March 14 Elections in Spain: A Dynamic Modelling Approach

2015

[EN] The bomb attacks in Madrid three days before the general elections of March 14, 2004, and their possible influence on the victory of PSOE (Spanish Workers Socialist Party), defeating PP (Popular Party), have been a matter of study from several points of view (i.e., sociological, political, or statistical). In this paper, we present a dynamic model based on a system of differential equations such that it, using data from Spanish CIS (National Center of Sociological Research), describes the evolution of voting intention of the Spanish people over time. Using this model, we conclude that the probability is very low that the PSOE would have won had the attack not happened.Moreover, after t…

Article SubjectOperations researchlcsh:MathematicsApplied Mathematicsmedia_common.quotation_subjectSociological researchVictoryDynamic modellinglcsh:QA1-939PoliticsEconomyVotingGeneral electionProbabilistic analysis of algorithmsCenter (algebra and category theory)MATEMATICA APLICADAAnalysisMathematicsmedia_commonAbstract and Applied Analysis
researchProduct

Probabilistic Logic under Coherence: Complexity and Algorithms

2005

In previous work [V. Biazzo, A. Gilio, T. Lukasiewicz and G. Sanfilippo, Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System P, Journal of Applied Non-Classical Logics 12(2) (2002) 189---213.], we have explored the relationship between probabilistic reasoning under coherence and model-theoretic probabilistic reasoning. In particular, we have shown that the notions of g-coherence and of g-coherent entailment in probabilistic reasoning under coherence can be expressed by combining notions in model-theoretic probabilistic reasoning with concepts from default reasoning. In this paper, we continue this line of research. Based on the above sem…

conditional probability assessmentSettore MAT/06 - Probabilita' E Statistica MatematicaDivergence-from-randomness modelalgorithmsprobabilistic logicConditional probability assessments; probabilistic logic; g-coherence; g-coherent entailment; complexity and algorithms.Artificial IntelligenceProbabilistic logic networkprobabilistic logic under coherenceConditional probability assessmentsProbabilistic analysis of algorithmsNon-monotonic logicconditional constraintMathematicsg-coherent entailmentConditional probability assessments probabilistic logic g-coherence g-coherent entailment complexity and algorithms.Reasoning systemcomputational complexitymodel-theoretic probabilistic logicApplied Mathematicscomplexity and algorithmsProbabilistic logiclogical constraintProbabilistic argumentationg-coherenceconditional probability assessment logical constraint conditional constraint probabilistic logic under coherence model-theoretic probabilistic logic g-coherence g-coherent entailment computational complexity algorithmsProbabilistic CTLalgorithms; computational complexity; conditional constraint; conditional probability assessment; g-coherence; g-coherent entailment; logical constraint; model-theoretic probabilistic logic; probabilistic logic under coherenceAlgorithmAnnals of Mathematics and Artificial Intelligence
researchProduct

A probabilistic rainfall model to estimate the leading-edge lifetime of wind turbine blade coating system

2021

Rain-induced leading-edge erosion of wind turbine blades is associated with high repair and maintenance costs. For efficient operation and maintenance, erosion models are required that provide estimates of blade coating lifetime at a real scale. In this study, a statistical rainfall model is established that describes probabilistic distributions of rain parameters that are critical for site-specific leading-edge erosion assessment. A new droplet size distribution (DSD) is determined based on two years’ onshore rainfall data of an inland site in the Netherlands and the obtained DSD is compared with those from the literature. Joint probability distribution functions of rain intensities and dr…

Probabilistic analysisScale (ratio)Turbine bladeMeteorologyRenewable Energy Sustainability and the EnvironmentProbabilistic logicLeading-edge erosionTurbineAnalytical methodWind speedWind turbine bladelaw.inventionVDP::Teknologi: 500Joint probability distributionlawErosionEnvironmental scienceProbabilistic analysis of algorithmsLong term analysis
researchProduct